Infinite Server Queues with Synchronized Departures Driven by a Single Point Process
نویسندگان
چکیده
منابع مشابه
Infinite Server Queues with Synchronized Departures Driven by a Single Point Process
We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {Tn} according to the following rules. At time Tn, a single customer (or a batch of size βn) arrives to the system. The service requirement of the ith customer in the nth batch is σi,n. All customers enter service immediately upon arrival but each customer leaves the system at the ...
متن کاملA note on Infinite-Server Markov modulated and Single-Server retrial Queues
We reconsider the M/M/∞ queue with two-state Markov modulated arrival and service processes and the singleserver retrial queue analyzed in Keilson and Servi [1]. Fuhrmann and Cooper type stochastic decomposition holds for the stationary occupancy distributions in both queues ([1] and [2]). The main contribution of the present paper is the derivation of the explicit form of the stationary system...
متن کاملstationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملRare-event Simulation for Infinite Server Queues
We discuss rare-event simulation methodology for computing tail probabilities for infinite-server queues. Our theoretical discussion also offers some new simulation insights into the change-of-measure associated with the Gärtner-Ellis theorem of large deviations.
متن کاملMarkov-modulated infinite-server queues: approximations by time-scaling
This paper studies an infinite-server queue in a semi-Markov environment: the queue’s input rate is modulated by a semi-Markovian background process, and the service times are assumed to be exponentially distributed. The primary objective of this paper is to propose approximations for the queue-length distribution, based on time-scaling arguments. The analysis starts with an explicit analysis o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2004
ISSN: 0257-0130
DOI: 10.1023/b:ques.0000046580.95906.0a